Exact SOR Convergence Regions for a General Class of p-Cyclic Matrices
نویسندگان
چکیده
Linear systems whose associated block Jacobi iteration matrix B is weakly cyclic generated by the cyclic permutation u = (ul , 02,. . . , up) in the spirit of Li and Varga are considered. Regions of convergence for the corresponding block pcyclic SOR method are derived and the exact convergence domains for real spectra, u(BP), of the same sign are obtained. Moreover, analytical expressions for two special cases for p = 5 are given. The tools used for this work are mainly from complex analysis and extensive use of (asteroidal) hypocycloids in the complex plane is made to produce our results.
منابع مشابه
On Domains of Superior Convergence of the SSOR Method Over the SOR Method for p- Cyclic H-Matrices
متن کامل
A General Theory of Optimal p-Cyclic SOR
The convergence theory of the Successive Overrelaxation (SOR) iterative method for the solution of nonsingular linear systems Ax = b, when the matrix A has a block p X P partitioned p-cyclic form, is well documented. However, when A is singular the corresponding theory is far behind that for the nonsingular case. Our purpose in this paper is to extend the p-cyclic SOR theory to consistent singu...
متن کاملOn The Exact P-Cyclic SSOR Convergence Domains
Suppose that A E (]J',n is a block p-cyclic consistently ordered matrix and let Band Sw denote , respectively, the black Jacobi and the block Symmetric Successive Overrelaxation (SSOR) iteration matrices associated with A. Neumaier a.nd Varga found (in the (p(IBI),w)-plane) the exact convergence and divergence domains of the SSOR method for the class of H-matrice8. Hadjidimos and Neumann applie...
متن کاملSOR-Met hods for the Eigenvalue Problem with Large Sparse Matrices
The eigenvalue problem Ax = \Bx, where A and B are large and sparse symmetric matrices, is considered. An iterative algorithm for computing the smallest eigenvalue and its corresponding eigenvector, based on the successive overrelaxation splitting of the matrices, is developed, and its global convergence is proved. An expression for the optimal overrelaxation factor is found in the case where A...
متن کاملStair Matrices and Their Generalizations with Applications to Iterative Methods I: a Generalization of the Sor Method
Stair matrices and their generalizations are introduced. Some properties of the matrices are presented. Like triangular matrices this class of matrices provides bases of matrix splittings for iterative methods. A remarkable feature of iterative methods based on the new class of matrices is that the methods are easily implemented for parallel computation. In particular, a generalization of the S...
متن کامل